Automatic simplification of Darcy’s equations with pressure dependent permeability
نویسندگان
چکیده
منابع مشابه
Spectral discretization of Darcy's equations with pressure dependent porosity
We consider the flow of a viscous incompressible fluid in a rigid homogeneous porous medium provided with boundary conditions on the pressure around a circular well. When the boundary pressure presents high variations, the permeability of the medium depends on the pressure, so that the model is nonlinear. We propose a spectral discretization of the resulting system of equations which takes into...
متن کاملAutomatic estimation of pressure-dependent rate coefficientsw
A general framework is presented for accurately and efficiently estimating the phenomenological pressure-dependent rate coefficients for reaction networks of arbitrary size and complexity using only high-pressure-limit information. Two aspects of this framework are discussed in detail. First, two methods of estimating the density of states of the species in the network are presented, including ...
متن کاملGeneralized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view-dependence tree of general vertex-pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. D...
متن کاملOptimization with the time-dependent Navier-Stokes equations as constraints
In this paper, optimal distributed control of the time-dependent Navier-Stokes equations is considered. The control problem involves the minimization of a measure of the distance between the velocity field and a given target velocity field. A mixed numerical method involving a quasi-Newton algorithm, a novel calculation of the gradients and an inhomogeneous Navier-Stokes solver, to find the opt...
متن کاملAutomatic induction of rules for text simplification
Long and complicated sentences pose various problems to many state-of-the-art natural language technologies. We have been exploring methods to automatically transform such sentences as to make them simpler. These methods involve the use of a rule-based system, driven by the syntax of the text in the domain of interest. Hand-crafting rules for every domain is time-consuming and impractical. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2013
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an/2013089